- clausal form
- Компьютерная техника: стандартная форма
Универсальный англо-русский словарь. Академик.ру. 2011.
clausal form
Смотреть что такое "clausal form" в других словарях:
Clausal normal form — The clausal normal form (or clause normal form, conjunctive normal form, CNF) of a logical formula is used in logic programming and many theorem proving systems. A formula in clause normal form is a set of clauses, interpreted as a conjunction. A … Wikipedia
Conjunctive normal form — In Boolean logic, a formula is in conjunctive normal form (CNF) if it is a conjunction of clauses, where a clause is a disjunction of literals. As a normal form, it is useful in automated theorem proving. It is similar to the product of sums form … Wikipedia
Normal form — may refer to: Normal form (abstract rewriting) Normal form (databases) Normal form (game theory) Normal form (mathematics) In formal language theory: Beta normal form Chomsky normal form Greibach normal form Kuroda normal form Normal form… … Wikipedia
Planner (programming language) — Planner (often seen in publications as PLANNER although it is not an acronym) is a programming language designed by Carl Hewitt at MIT, and first published in 1969. First, subsets such as Micro Planner and Pico Planner were implemented, and then… … Wikipedia
SLD resolution — ( Selective Linear Definite clause resolution) is the basic inference rule used in logic programming. It is a refinement of resolution, which is both sound and refutation complete for Horn clauses. The SLD inference ruleGiven a goal clause: eg L… … Wikipedia
Logic programming — is, in its broadest sense, the use of mathematical logic for computer programming. In this view of logic programming, which can be traced at least as far back as John McCarthy s [1958] advice taker proposal, logic is used as a purely declarative… … Wikipedia
Richard Waldinger — Richard J. Waldinger is a computer science researcher at SRI Artificial Intelligence Laboratory (where he has worked since 1969) whose interests focus on the application of automated deductive reasoning to problems in software engineering and… … Wikipedia
Prover9 — is an automated theorem prover for First order and equational logic developed by William McCune. Prover9 is the successor of the Otter theorem prover.Prover9 is intentionally paired with Mace4, which searches for finite models and counterexamples … Wikipedia
Sentence element — Sentence elements are the groups of words that combine together to comprise the ‘building units’ of a well formed sentence. A sentence element approach to grammar assumes a top down methodology. In other words, it starts with the sentence as a… … Wikipedia
Nominal TAM — is the indication of tense–aspect–mood by inflecting a noun, rather than a verb. In clausal nominal TAM, the noun indicates TAM information about the clause. Whether or not a particular language can best be understood as having clausal nominal… … Wikipedia
Zapotec languages — Zapotec Diidzaj, Diza, Ditsa, Diidxazá, Tiits Së . . . Spoken in Mexico (Oaxaca, Puebla, Guerrero); USA Native speakers ca 500,000 (date missing) … Wikipedia
